/**
 * Copyright (c) 2011 by Kevin Bierhoff.
 * All rights reserved.
 *
 * Redistribution and use in source and binary forms, with or without
 * modification, are permitted provided that the following conditions are met:
 *    1. Redistributions of source code must retain the above copyright
 *       notice, this list of conditions and the following disclaimer.
 *    2. Redistributions in binary form must reproduce the above copyright
 *       notice, this list of conditions and the following disclaimer in the
 *       documentation and/or other materials provided with the distribution.
 *    3. Neither the names of the authors nor the
 *       names of its contributors may be used to endorse or promote products
 *       derived from this software without specific prior written permission.
 *
 * THIS SOFTWARE IS PROVIDED BY THE AUTHORS ''AS IS'' AND ANY
 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
 * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
 * DISCLAIMED. IN NO EVENT SHALL THE AUTHORS BE LIABLE FOR ANY
 * DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
 * INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
 * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
 * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
 */
package com.googlecode.syper.test.jmlsyp.parsing;

import edu.cmu.cs.crystal.annotations.FailingTest;
import edu.cmu.cs.crystal.annotations.UseAnalyses;

/** Failing {@link Quantifier} test cases */
@FailingTest(3)
@UseAnalyses("SymbolicChecker")
public class QuantifierFail {

	/** Tests concluding from {@code \forall} to a single array element */
	//@ requires (\forall int i ; 0 <= i & i < is.length ; is[i] != 0);
	//@ requires is != null;
	//@ ensures \result != 0;
	public int mult(int[] is) {
		int result = 1;
		int i = 0;
		//@ loop_invariant 0 <= i & i <= is.length;
		//@ loop_invariant result != 0;
		for (; i < is.length; ++i) {
			// fails because elements are non-zero
			assert is[i] != 1;
			result *= is[i];
		}
		return result;
	}

	/** Tests contradicting {@code \forall} and {@code \exists} */
	//@ requires (\exists int i ; 0 <= i & i < is.length ; is[i] == 0);
	//@ requires is != null;
	//@ ensures \result;
	public boolean hasZero(int[] is) {
		int i = 0;
		boolean result = false;
		//@ loop_invariant 0 <= i & i <= is.length;
		//@ loop_invariant !result == (\forall int j ; 0 <= j & j < i ; is[j] != 0);
		for (; i < is.length; ++i) {
			if (is[i] == 0)
				result = true;
		}
		// contradicts pre-condition
		//@ assert (\forall int j ; 0 <= j & j < i ; is[j] != 0);
		return result;
	}

	/** Tests trivially false existential */
	//@ requires (\exists int i ; 0 <= i & i < is.length ; is[i] == 0);
	//@ requires is != null & is.length == 2;
	public void oneZero(int[] is) {
		// fails because is[1] could be the single 0 element
		assert is[0] == 0;
	}
}
